Watermark Resynchronization based on Elastic Graph Matching
نویسندگان
چکیده
Most of the watermarking algorithms can still be defeated by geometric distortions today. If the weakness against global distortions can almost be considered as solved, local geometric distortions such as the ones introduced by StirMark remain a major issue. In this paper, an original resynchronization method is presented as a potential countermeasure against such attacks. The basic idea consists in interlacing resynchronization bits with the bits carrying the payload during the watermark embedding. During the extraction, those bits are used as anchor points to estimate and compensate for both small local and global geometric distortions. This registration procedure is performed using an Elastic Graph Matching (EGM) approach.
منابع مشابه
Watermark Resynchronization Based on Elastic Graph Matching for Enhanced Robustness Against Local Geometric Distortions
Most of the watermarking algorithms can still be defeated by geometric distortions today. If the weakness against global distortions can almost be considered as solved, local geometric distortions such as the ones introduced by StirMark remain a major issue. An original resynchronization method is consequently proposed in this report as a potential countermeasure against such attacks. The basic...
متن کاملA Channel Model for Watermarks Subject to Desynchronization Attacks
One of the most important practical problems of blind Digital Watermarking is the resistance against desynchronization attacks, one of which is the Stirmark random bending attack in the case of image watermarking. Recently, new blind digital watermarking schemes have been proposed which do not suffer from host-signal interference. One of these quantization based watermarking scheme is the Scala...
متن کاملImage Watermarking Resynchronization to Geometric Attacks in DWT Domain
This paper presents a novel image watermarking resynchronization technique in discrete wavelet trans-form (DWT) domain. Rotation and shearing attacks desynchronizing watermark model in DWT domain are given respectively. According to these models, two corresponding watermarking resynchronization algorithms are proposed. The ideal watermark can be extracted from the resynchronized watermarked ima...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملThe role of topographical constraints in face recognition
The role of topographical constraints for recognition performance is investigated systematically for the case of face recognition. Images are represented by rectangular graphs labeled with jets, based on a Gabor wavelet transform. Topographical constraints are varied between rigid and no constraints. A comparison with two elastic graph matching algorithms is made. The simple methods presented i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005